Identity-based Signature Proven Secure Under the Computation Linear Assumption
نویسندگان
چکیده
منابع مشابه
Fast and Proven Secure Blind Identity-Based Signcryption from Pairings
We present the first blind identity-based signcryption (BIBSC). We formulate its security model and define the security notions of blindness and parallel one-more unforgeability (p1m-uf). We present an efficient construction from pairings, then prove a security theorem that reduces its p1m-uf to Schnorr’s ROS Problem in the random oracle model plus the generic group and pairing model. The latte...
متن کاملIdentity-based Threshold Signature Secure in the Standard Model
Recently, design of Identity-based (ID-based) threshold signature schemes which are efficient and provably secure in the standard model has drawn great concerns. In this paper, an ID-based threshold signature scheme based on Paterson and Schuldt’s signature scheme is presented. The proposed construction is proved secure in the standard model and its security rests on the hardness of the computa...
متن کاملSecure Identity-Based Blind Signature Scheme in the Standard Model
The only known construction of identity-based blind signature schemes that are secure in the standard model is based on the generic approach of attaching certificates to ordinary (i.e. non-identity-based) blind signature schemes, and thus the identity-based blind signature schemes constructed using this method are somewhat inefficient and have long signature size. In this paper, we present the ...
متن کاملEfficient forward secure identity-based shorter signature from lattice
All regular cryptographic schemes rely on the security of the secret key. However, with the explosive use of some relatively insecure mobile devices, the key exposure problem has become more aggravated. In this paper, we propose an efficient forward secure identitybased signature (FSIBS) scheme from lattice assumption, with its security based on the small integer solution problem (SIS) in the r...
متن کاملForward-Secure Identity-Based Shorter Blind Signature from Lattices
Blind signature (BS) plays one of key ingredients in electronic cash or electronic voting system. However, the key exposures bring out very serious problems in insecure mobile devices. Forward-secure blind signatures preserve the validity of past signatures and prevent a forger from forging past signatures even if current secret key has been compromised. In this paper, we propose the first forw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Engineering and Technology Research
سال: 2017
ISSN: 2475-885X
DOI: 10.12783/dtetr/eeta2017/7760